Ultrafast compartmentalized relaxation time mapping with linear algebraic modeling
نویسندگان
چکیده
منابع مشابه
TRANSIT Ultrafast Shortest-Path Queries with Linear-Time Preprocessing
We introduce the concept of transit nodes, as a means for preprocessing a road network, with given coordinates for each node and a travel time for each edge, such that point-to-point shortest-path queries can be answered extremely fast. The transit nodes are a set of nodes as small as possible with the property that every shortest path that is non-local in the sense that it covers a certain not...
متن کاملConformal Mapping in Linear Time
Given any ǫ > 0 and any planar region Ω bounded by a simple n-gon P we construct a (1 + ǫ)-quasiconformal map between Ω and the unit disk in time C(ǫ)n. One can take C(ǫ) = C + C log 1 ǫ log log 1 ǫ . Date: August 13, 2009. 1991 Mathematics Subject Classification. Primary: 30C35, Secondary: 30C85, 30C62 .
متن کاملStabilization of Linear Differential-algebraic Equations with Time-varying Delay
Stabilization involves finding feedback controllers which stabilize the closed-loop system in the finite-time sense. Stability and control have been developed in the literature using Lyapunov-like method. In this paper, we develop a general framework for stabilization of linear differential-algebraic equations with time-varying delay. Based on Lyapunov-like function method and new bound estimat...
متن کاملLinear threaded algebraic space-time constellations
Space–time (ST) constellations that are linear over the field of complex numbers are considered. Relevant design criteria for these constellations are summarized and some fundamental limits to their achievable performances are established. The fundamental tradeoff between rate and diversity is investigated under different constraints on the peak power, receiver complexity, and rate scaling with...
متن کاملEnhancing Algebraic Query Relaxation with Semantic Similarity
Cooperative database systems support a database user by searching for answers that are closely related to his query and hence are informative answers. Common operators to relax the user query are Dropping Condition, Anti-Instantiation and Goal Replacement. In this article, we provide an algebraic version of these operators. Moreover we propose some heuristics to assign a degree of similarity to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Magnetic Resonance in Medicine
سال: 2017
ISSN: 0740-3194
DOI: 10.1002/mrm.26675